Singularity analysis and asymptotics of Bernoulli sums
نویسندگان
چکیده
منابع مشابه
Singularity Analysis and Asymptotics of Bernoulli Sums Singularity Analysis and Asymptotics of Bernoulli Sums Singularity Analysis and Asymptotics of Bernoulli Sums
The asymptotic analysis of a class of binomial sums that arise in information theory can be performed in a simple way by means of singularity analysis of generating functions. The method developed extends the range of applicability of singularity analysis techniques to combinatorial sums involving transcendental elements like logarithms or fractional powers. Analyse de singularit e et asymptoti...
متن کاملDivisors of Bernoulli sums
Let B n = b 1 +. .. + b n , n ≥ 1 where b 1 , b 2 ,. .. are independent Bernoulli random variables. In relation with the divisor problem, we evaluate the almost sure asymptotic order of the sums N n=1 d θ,D (B n), where d θ,D (B n) = #{d ∈ D, d ≤ n θ : d|B n } and D is a sequence of positive integers.
متن کاملSums of Products of Bernoulli Numbers, Including Poly-Bernoulli Numbers
We investigate sums of products of Bernoulli numbers including poly-Bernoulli numbers. A relation among these sums and explicit expressions of sums of two and three products are given. As a corollary, we obtain fractional parts of sums of two and three products for negative indices.
متن کاملBernoulli numbers and generalized factorial sums
We prove a pair of identities expressing Bernoulli numbers and Bernoulli numbers of the second kind as sums of generalized falling factorials. These are derived from an expression for the Mahler coefficients of degenerate Bernoulli numbers. As corollaries several unusual identities and congruences are derived.
متن کاملOn Bernoulli Sums and Bernstein Polynomials
In the paper we discuss a technology based on Bernstein polynomials of asymptotic analysis of a class of binomial sums that arise in information theory. Our method gives a quick derivation of required sums and can be generalized to multinomial distributions. As an example we derive a formula for the entropy of multinomial distributions. Our method simplifies previous work of Jacquet, Szpankowsk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00220-5